Auslander–Reiten translations in monomorphism categories

The monomorphism problem in free groups

Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if there is an algorithm such that, for any two elements u and v in F , it determines whether there exists a monomorphism of F that sends u to v. In this paper we show that the monomorphism problem is decidable and we provide an effective algorithm that solves the problem. Mathematics Subject Classifica...

collocation errors in translations of the holy quran

the present study aims at identifying, classifying and analyzing collocation errors made by translators of the holy quran into english.findings indicated that collocationally the most acceptablt translation was done by ivring but the least appropriate one made by pickthall.

Po-S-Dense Monomorphism

‎In this paper we take $mathcal A$ to be the category {bf Pos-S}‎ ‎of $S$-posets‎, ‎for a posemigroup $S$‎, ${mathcal M}_{pd}$ to‎ ‎be the class of partially ordered sequantially-dense‎ ‎monomorphisms and study the categorical properties‎, ‎such as‎ ‎limits and colimits‎, ‎of this class‎. ‎These properties are usually‎ ‎needed to study the homological notions‎, ‎such as injectivity‎, ‎of‎ ‎$S$-...

Translations

Limits in modified categories of interest

‎We firstly prove the completeness of the category of crossed modules in a modified category of interest‎. ‎Afterwards‎, ‎we define pullback crossed modules and pullback cat objects that are both obtained by pullback diagrams with extra structures on certain arrows‎. ‎These constructions unify many corresponding results for the cases of groups‎, ‎commutative algebras and can also be adapted to ...